Solving *-Problems Modulo Distributivity by a Reduction to AC1-Unification

نویسنده

  • Evelyne Contejean
چکیده

(Received) We show that uniication modulo both-sided distributivity of the symbol on + can be reduced to AC1-uniication for all uniication problems which do not involve the + operator. Moreover, in this case, we can describe \almost all" solutions in a nite way, although there are in general innnitely many minimal solutions for such problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Partial Solution for D-Unification Based on a Reduction to AC1-Unification

We show that deciding uniication modulo both-sided dis-tributivity of a symbol over a symbol + can be reduced to AC1-uniication for all uniication problems which do not involve the + operator. Moreover, we can describe \almost all" solutions in a nite way, although there are in general innnitely many minimal solutions for such problems. As a consequence,-problems appear as a good candidate for ...

متن کامل

On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry

An algorithm for unification modulo one-sided distributivity is an early result by Tidén and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this property. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed. ...

متن کامل

An Algorithm for Distributive Unification

We consider unification of terms under the equational theory of two-sided distributivity D with the axioms x*(y+z) = x*y + x*z and (x+y)*z = x*z + y*z. The main result of this paper is that Dunification is decidable by giving a non-deterministic transformation algorithm. The generated unification are: an AC1-problem with linear constant restrictions and a second-order unification problem that c...

متن کامل

On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity

Equational unification is central to automated deduction and its applications in areas such as symbolic protocol analysis. In particular, the unification problem for the theory AC (“Associativity-Commutativity”) and its extensions ACI (“AC plus Idempotence”) and ACUI (“ACI with Unit element”) have been studied in great detail in the past. Distributivity (of one binary operator over another) has...

متن کامل

Unification Modulo ACU I Plus Homomorphisms/Distributivity

E-unification problems are central in automated deduction. In this paper, we consider theories that are extensions of the well-known ACI or ACUI , obtained by adding finitely many homomorphism symbols, or a symbol ‘∗’ that distributes over the ACUIsymbol denoted ‘+’. We first show that when we adjoin a set of commuting homomorphisms to ACUI , unification is undecidable. We then consider the ACU...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1993